Closure properties of cellular automata

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algebraic Properties of Cellular Automata

Cellular automata are discrete dynamical systems, of simple construction but complex and varied behaviour. Algebraic techniques are used to give an extensive analysis of the global properties of a class of finite cellular automata. The complete structure of state transition diagrams is derived in terms of algebraic and number theoretical quantities. The systems are usually irreversible, and are...

متن کامل

Topological properties of sand automata as cellular automata

In this paper, we exhibit a strong relation between the sand automata configuration space and the cellular automata configuration space. This relation induces a compact topology for sand automata, and a new context in which sand automata are homeomorphic to cellular automata acting on a specific subshift. We show that the existing topological results for sand automata, including the Hedlund-lik...

متن کامل

Topological properties of cellular automata on trees

We prove that there do not exist positively expansive cellular automata defined on the full k-ary tree shift (for k ≥ 2). Moreover, we investigate some topological properties of these automata and their relationships, namely permutivity, surjectivity, preinjectivity, right-closingness and openness.

متن کامل

Strongly Mixing Properties of Multidimensional Cellular Automata

This paper investigates the k-mixing property of a multidimensional cellular automaton. Suppose F is a cellular automaton with the local rule f defined on a d-dimensional convex hull C which is generated by an apex set C. Then F is k-mixing with respect to the uniform Bernoulli measure for all positive integer k if f is a permutation at some apex in C. An algorithm called the Mixing Algorithm i...

متن کامل

Critical Properties of Toom Cellular Automata

The following paper is the continuation of our earlier considerations on cellular automata with Toom local rule (TCA) as the alternative to kinetic Ising systems. The arguments for TCA stationary states not being the equilibrium states are found in simulations.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2006

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2005.10.039